We derive the desired running time bounds for the mergeable heap operations using the potential method for amortized analysis.
2.
Specifically, it is a mergeable heap supporting access to the elements of the heap via handles ( also called references ).
3.
It is important as an implementation of the mergeable heap abstract data type ( also called meldable heap ), which is a priority queue supporting merge operation.
मोबाइल